Chaotic Crossover Operator on Genetic Algorithm
نویسندگان
چکیده
منابع مشابه
Chaotic Crossover Operator on Genetic Algorithm
In this paper, chaos based a new arithmetic crossover operator on the genetic algorithm has been proposed. The most frequent issue for the optimization algorithms is stuck on problem's defined local minimum points and it needs excessive amount of time to escape from them; therefore, these algorithms may never find global minimum points. To avoid and escape from local minimums, a chaotic arithme...
متن کاملPath Cost Optimization Using Genetic Algorithm with Supervised Crossover Operator
Path cost optimization is essential for maneuvering vehicles in a cost effective way. The term cost can be interpreted as fuel consumption, path visibility, probability of being detected, probability of being attacked or a combination of the above. Exact algorithms such as linear programming and dynamic programming can always provide globally optimum solution to such a problem. However, as the ...
متن کاملGuided Crossover: A New Operator for Genetic Algorithm Based Optimization
Genetic algorithms (GAs) have been extensively used in different domains as a means of doing global optimization in a simple yet reliable manner. They have a much better chance of getting to global optima than gradient-based methods which usually converge to local sub-optima. However, GAs have a tendency of getting only moderately close to the optima in a small number of iterations. To get very...
متن کاملA Genetic Algorithm with Fuzzy Crossover Operator and Probability
The performance of a genetic algorithm is dependent on the genetic operators, in general, and on the type of crossover operator, in particular. The population diversity is usually used as the performance measure for the premature convergence. In this paper, a fuzzy genetic algorithm is proposed for solving binary encoded combinatorial optimization problems. A new crossover operator and probabil...
متن کاملGuided Crossover : A New Operator for Genetic Algorithm
Genetic algorithms (GAs) have been extensively used in diierent domains as a means of doing global optimization in a simple yet reliable manner. They have a much better chance of getting to global optima than gradient based methods which usually converge to local sub optima. However, GAs have a tendency of getting only moderately close to the optima in a small number of iterations. To get very ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Advances in Information Technology
سال: 2015
ISSN: 1798-2340
DOI: 10.12720/jait.6.4.217-220